1,238 research outputs found

    Density-Based Unsupervised Classification for Remote Sensing *

    Get PDF
    Most image classification methods are supervised and use a parametric model of the classes that have to be detected. The models of the different classes are trained by means of a set of training regions that usually have to be marked and classified by a human interpreter. Unsupervised classification methods are data-driven methods that do not use such a set of training samples. Instead, these methods look for (repeated) structures in the data. In this paper we describe a non-parametric unsupervised classification method. The method uses biased sampling to obtain a learning sample with little noise. Next, density estimation based clustering is used to find the structure in the learning data. The method generates a non-parametric model for each of the classes and uses these models to classify the pixels in the image

    Quantitative Chevalley-Weil theorem for curves

    Get PDF
    The classical Chevalley-Weil theorem asserts that for an \'etale covering of projective varieties over a number field K, the discriminant of the field of definition of the fiber over a K-rational point is uniformly bounded. We obtain a fully explicit version of this theorem in dimension 1.Comment: version 4: minor inaccuracies in Lemma 3.4 and Proposition 5.2 correcte

    Turning points: the personal and professional circumstances that lead academics to become middle managers

    Get PDF
    In the current higher education climate, there is a growing perception that the pressures associated with being an academic middle manager outweigh the perceived rewards of the position. This article investigates the personal and professional circumstances that lead academics to become middle managers by drawing on data from life history interviews undertaken with 17 male and female department heads from a range of disciplines, in a post-1992 UK university. The data suggests that experiencing conflict between personal and professional identities, manifested through different socialization experiences over time, can lead to a ‘turning point’ and a decision that affects a person’s career trajectory. Although the results of this study cannot be generalized, the findings may help other individuals and institutions move towards a firmer understanding of the academic who becomes head of department—in relation to theory, practice and research

    Formal Hecke algebras and algebraic oriented cohomology theories

    Full text link
    In the present paper we generalize the construction of the nil Hecke ring of Kostant-Kumar to the context of an arbitrary algebraic oriented cohomology theory of Levine-Morel and Panin-Smirnov, e.g. to Chow groups, Grothendieck's K_0, connective K-theory, elliptic cohomology, and algebraic cobordism. The resulting object, which we call a formal (affine) Demazure algebra, is parameterized by a one-dimensional commutative formal group law and has the following important property: specialization to the additive and multiplicative periodic formal group laws yields completions of the nil Hecke and the 0-Hecke rings respectively. We also introduce a deformed version of the formal (affine) Demazure algebra, which we call a formal (affine) Hecke algebra. We show that the specialization of the formal (affine) Hecke algebra to the additive and multiplicative periodic formal group laws gives completions of the degenerate (affine) Hecke algebra and the usual (affine) Hecke algebra respectively. We show that all formal affine Demazure algebras (and all formal affine Hecke algebras) become isomorphic over certain coefficient rings, proving an analogue of a result of Lusztig.Comment: 28 pages. v2: Some results strengthened and references added. v3: Minor corrections, section numbering changed to match published version. v4: Sign errors in Proposition 6.8(d) corrected. This version incorporates an erratum to the published versio

    The arithmetic of hyperelliptic curves

    Get PDF
    We summarise recent advances in techniques for solving Diophantine problems on hyperelliptic curves; in particular, those for finding the rank of the Jacobian, and the set of rational points on the curve

    Another Look at Some Isogeny Hardness Assumptions

    Get PDF
    The security proofs for isogeny-based undeniable signature schemes have been based primarily on the assumptions that the One-Sided Modified SSCDH problem and the One-More SSCDH problem are intractable. We challenge the validity of these assumptions, showing that both the decisional and computational variants of these problems can be solved in polynomial time. We further demonstrate an attack, applicable to two undeniable signature schemes, one of which was proposed at PQCrypto 2014. The attack allows to forge signatures in 24λ/5 steps on a classical computer. This is an improvement over the expected classical security of 2λ, where λ denotes the chosen security parameter.SCOPUS: cp.kinfo:eu-repo/semantics/publishedCryptographers Track at the RSA Conference, CT-RSA 2020; San Francisco; United States; 24 February 2020 through 28 February 2020ISBN: 978-303040185-

    Quantum resource estimates for computing elliptic curve discrete logarithms

    Get PDF
    We give precise quantum resource estimates for Shor's algorithm to compute discrete logarithms on elliptic curves over prime fields. The estimates are derived from a simulation of a Toffoli gate network for controlled elliptic curve point addition, implemented within the framework of the quantum computing software tool suite LIQUiUi|\rangle. We determine circuit implementations for reversible modular arithmetic, including modular addition, multiplication and inversion, as well as reversible elliptic curve point addition. We conclude that elliptic curve discrete logarithms on an elliptic curve defined over an nn-bit prime field can be computed on a quantum computer with at most 9n+2log2(n)+109n + 2\lceil\log_2(n)\rceil+10 qubits using a quantum circuit of at most 448n3log2(n)+4090n3448 n^3 \log_2(n) + 4090 n^3 Toffoli gates. We are able to classically simulate the Toffoli networks corresponding to the controlled elliptic curve point addition as the core piece of Shor's algorithm for the NIST standard curves P-192, P-224, P-256, P-384 and P-521. Our approach allows gate-level comparisons to recent resource estimates for Shor's factoring algorithm. The results also support estimates given earlier by Proos and Zalka and indicate that, for current parameters at comparable classical security levels, the number of qubits required to tackle elliptic curves is less than for attacking RSA, suggesting that indeed ECC is an easier target than RSA.Comment: 24 pages, 2 tables, 11 figures. v2: typos fixed and reference added. ASIACRYPT 201

    Temperament and parental child-rearing style: unique contributions to clinical anxiety disorders in childhood

    Full text link
    Both temperament and parental child-rearing style are found to be associated with childhood anxiety disorders in population studies. This study investigates the contribution of not only temperament but also parental child-rearing to clinical childhood anxiety disorders. It also investigates whether the contribution of temperament is moderated by child-rearing style, as is suggested by some studies in the general population. Fifty children were included (25 with anxiety disorders and 25 non-clinical controls). Child-rearing and the child’s temperament were assessed by means of parental questionnaire (Child Rearing Practices Report (CRPR) (Block in The Child-Rearing Practices Report. Institute of Human Development. University of California, Berkely, 1965; The Child-Rearing Practices Report (CRPR): a set of Q items for the description of parental socialisation attitudes and values. Unpublished manuscript. Institute of Human Development. University of California, Berkely, 1981), EAS Temperament Survey for Children (Boer and Westenberg in J Pers Assess 62:537–551, 1994; Buss and Plomin in Temperament: early developing personality traits. Lawrence Erlbaum Associates, Inc, Hillsdale, 1984s). Analysis of variance showed that anxiety-disordered children scored significantly higher on the temperamental characteristics emotionality and shyness than non-clinical control children. Hierarchical logistic regression analyses showed that temperament (emotionality and shyness) and child-rearing style (more parental negative affect, and less encouraging independence of the child) both accounted for a unique proportion of the variance of anxiety disorders. Preliminary results suggest that child-rearing style did not moderate the association between children’s temperament and childhood anxiety disorders. The limited sample size might have been underpowered to assess this interaction
    corecore